Distributions of Mersenne divisors

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Divisors of Mersenne Numbers By Samuel

We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers Mp in the range 17000 < p < 105.

متن کامل

Sums of Prime Divisors and Mersenne Numbers

The study of the function β(n) originated in the paper of Nelson, Penney, and Pomerance [7], where the question was raised as to whether the set of Ruth-Aaron numbers (i.e., natural numbers n for which β(n) = β(n+ 1)) has zero density in the set of all positive integers. This question was answered in the affirmative by Erdős and Pomerance [5], and the main result of [5] was later improved by Po...

متن کامل

On an Invariant of Divisors of Mersenne Number

where p is prime. In our paper we use the latter name. In this form numbers Mp at the first time were studied by Marin Mersenne (1588-1648) at least in 1644 (see in [1, p.9] and a large bibliography there). In our paper we show that all composite Mersenne numbers belong to a class S of pseudoprimes of base 2 which is a subclass of super-Poulet pseudoprimes. Analysis of properties of pseudoprime...

متن کامل

Gaussian Mersenne and Eisenstein Mersenne primes

The Biquadratic Reciprocity Law is used to produce a deterministic primality test for Gaussian Mersenne norms which is analogous to the Lucas–Lehmer test for Mersenne numbers. It is shown that the proposed test could not have been obtained from the Quadratic Reciprocity Law and Proth’s Theorem. Other properties of Gaussian Mersenne norms that contribute to the search for large primes are given....

متن کامل

Generalised Mersenne Numbers Revisited

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1966

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-66-99919-4